Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
41	The Logarithmic Hypervolume Indicator Tobias Friedrich Karl Bringmann Max-Planck-Institut für Informatik Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:18 Mathematics Mathematical analysis Computational complexity theory Approximation algorithm Multiplicative inverse Logarithm Expected value Multi-objective optimization
42	FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION Marius Muja, David G. Lowe Computer Science Department, University of British Columbia, Vancouver, B.C., Canada , Add to Reading List Source URL: www.geog.ucsb.edu Language: English - Date: 2013-05-14 18:54:15 Search algorithms Information science Computing Computer programming Machine learning Data mining Approximation algorithms Discrete geometry Nearest neighbor search K-d tree K-nearest neighbors algorithm K-means clustering
43	Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218 Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:20 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Set cover problem Approximation algorithm Facility location problem Dominating set Combinatorial optimization Reduction Algorithm
44	I will discuss recent work on randomized algorithms for low-rank approximation and principal component analysis (PCA). The talk will focus on efforts that move beyond the extremely fast, but relatively crude approximatio Add to Reading List Source URL: mmds-data.org Language: English - Date: 2016-06-23 15:50:48 Algebra Mathematics Multivariate statistics Numerical analysis Dimension reduction Iterative methods Numerical linear algebra Principal component analysis Singular value decomposition Stochastic optimization Algorithm Sparse dictionary learning
45	IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 10, OCTOBERGreed is Good: Algorithmic Results for Sparse Approximation Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2007-09-11 17:01:55 Signal processing Mathematics Algebra Electrical engineering Matching pursuit Sparse approximation Babel function Coherence Wavelet Algorithm Approximation algorithm Linear programming
46	Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:31 Routing Approximation algorithm Binary trees Computing Coding theory Routing algorithms Discrete mathematics
47	CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-26 12:53:21 Mathematics Computational complexity theory Graph theory NP-complete problems Operations research Travelling salesman problem Theoretical computer science Approximation algorithm Steiner tree problem Greedy algorithm Optimization problem Set cover problem
48	Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Graph theory Mathematics Routing algorithms Edsger W. Dijkstra Combinatorial optimization Search algorithms Game artificial intelligence A* search algorithm Shortest path problem Flow network Tree Graph
49	Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India, Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-12-11 12:58:32 Graph theory Computational complexity theory Mathematics NP-complete problems Spanning tree Steiner tree problem Operations research Knowledge representation Edsger W. Dijkstra Minimum spanning tree Travelling salesman problem Approximation algorithm
50	CS264: Beyond Worst-Case Analysis Lecture #6: Clustering in Approximation-Stable Instances∗ Tim Roughgarden† October 10, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-06 18:13:07 Statistics Computational statistics Data analysis Cluster analysis Data mining Geostatistics K-means clustering K-medians clustering Approximation algorithm Median Data stream clustering Single-linkage clustering

UPDATE